|
Selective K-means clustering ensemble based on random sampling
WANG Lijuan HAO Zhifeng CAI Ruichu WEN Wen
Journal of Computer Applications
2013, 33 (07):
1969-1972.
DOI: 10.11772/j.issn.1001-9081.2013.07.1969
Without any prior information about data distribution, parameter and the labels of data, not all base clustering results can truly benefit for the combination decision of clustering ensemble. In addition, if each base clustering plays the same role, the performance of clustering ensemble may be weakened. This paper proposed a selective K-means clustering ensemble based on random sampling, called RS-KMCE. In RS-MKCE, random sampling can avoid local minimum in the process of selecting base clustering subset for ensemble. And the defined evaluation index according to diversity and accuracy can lead to a better base clustering subset for improving the performance of clustering ensemble. The experiment results on two synthetic datasets and four UCI datasets show that performance of the proposed RS-KMCE is better than K-means, K-means clustering ensemble, and selective K-means clustering ensemble based on bagging.
Reference |
Related Articles |
Metrics
|
|